Argumentation Semantics for Defeasible Logic
نویسندگان
چکیده
Defeasible reasoning is a simple but efficient rule-based approach to nonmonotonic reasoning. It haspowerful implementations and shows promise to be applied in the areas of legal reasoning and themodeling of business rules. This paper establishes significant links between defeasible reasoning andargumentation. In particular, Dung-like argumentation semantics is provided for two key defeasiblelogics, of which one is ambiguity propagating and the other ambiguity blocking.There are several reasons for the significance of this work: (a) establishing links between formalsystems leads to a better understanding and cross-fertilization, in particular our work sheds light on theargumentation-theoretic features of defeasible logic; (b) we provide the first ambiguity blocking Dung-like argumentation system; (c) defeasible reasoning may provide an efficient implementation platformfor systems of argumentation; and (d) argumentation-based semantics support a deeper understandingof defeasible reasoning, especially in the context of the intended applications.
منابع مشابه
Argumentation Semantics for Defeasible Logics
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of business rules. So far defeasible logic has been defined only proof-theoretically. Argumentation-based semantics have become popular in the area of logic programming. In this paper we give an argumentation...
متن کاملAn Argumentation-Theoretic Characterization of Defeasible Logic
Defeasible logic is an efficient non-monotonic logic that is defined only proof-theoretically. It has potential application in some legal domains. We present here an argumentation semantics for defeasible logic that will be useful in these applications. Our development differs at several points from existing argumentation frameworks since there are several features of defeasible logic that have...
متن کاملEmbedding Defeasible Logic Programs into Generalized Logic Programs
A novel argumentation semantics of defeasible logic programs (DeLP) is presented. Our goal is to build a semantics, which respects existing semantics and intuitions of “classical” logic programming. Generalized logic programs (GLP) are selected as an appropriate formalism for studying both undermining and rebutting. Our argumentation semantics is based on a notion of conflict resolution strateg...
متن کاملA characterization of collective conflict for defeasible argumentation
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among arguments. This allows us to ensure direct and indirect consistency (in the sense of Caminada and Amgoud) without distinguishing between direct and indirect conflicts. Then, the general defeasible argumentation framework is e...
متن کاملPossible World Semantics for Defeasible Deontic Logic
Defeasible Deontic Logic is a simple and computationally efficient approach for the representation of normative reasoning. Traditionally defeasible logics are defined proof theoretically based on the proof conditions for the logic. While several logic programming, operational and argumentation semantics have been provided for defeasible logics, possible world semantics for (modal) defeasible lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 14 شماره
صفحات -
تاریخ انتشار 2004